import sys
import math
CIRCLE = 1
TRIANGLE = 2
SQUARE = 3
n = int(sys.stdin.readline().strip())
arr = sys.stdin.readline().split()
arr = [int(e) for e in arr]
total = 0
isInfinite = False
for i in range(1,n):
if arr[i] == SQUARE and arr[i-1] == TRIANGLE:
isInfinite = True
break
if arr[i] == SQUARE and arr[i-1] == CIRCLE:
total += 4
if arr[i] == CIRCLE and arr[i-1] == TRIANGLE:
total += 3
if arr[i] == CIRCLE and arr[i-1] == SQUARE:
total += 4
if arr[i] == TRIANGLE and arr[i-1] == SQUARE:
isInfinite = True
break
if arr[i] == TRIANGLE and arr[i-1] == CIRCLE:
if i > 1 and arr[i-2] == SQUARE:
total += 2
else:
total += 3
if isInfinite:
print("Infinite")
else:
print("Finite")
print(total)#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
vector<int> a(n);
bool flag=0;
int ans=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(i>0){
if(min(a[i-1],a[i])==2 && max(a[i],a[i-1])==3){
flag=1;
}
else if(min(a[i-1],a[i])==1 && max(a[i],a[i-1])==2){
ans+=3;
}
else if(min(a[i-1],a[i])==1 && max(a[i],a[i-1])==3){
ans+=4;
}
}
if(i>1){
if(a[i-2]==3 && a[i-1]==1 && a[i]==2){
ans--;
}
}
}
if(flag)cout<<"Infinite\n";
else{
cout<<"Finite\n";
cout<<ans<<endl;
}
return 0;
}
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |
1295. Find Numbers with Even Number of Digits | 1704. Determine if String Halves Are Alike |
1732. Find the Highest Altitude | 709. To Lower Case |
1688. Count of Matches in Tournament | 1684. Count the Number of Consistent Strings |
1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |